Analysis on Non-negative Factorizations and Applications

نویسندگان

  • Yat Tin Chow
  • Kazufumi Ito
  • Jun Zou
چکیده

In this work we apply non-negative matrix factorizations (NMF) to some imaging and inverse problems. We propose a sparse low-rank approximation of big data and images in terms of tensor products, and investigate its effectiveness in terms of the number of tensor products to be used in the approximation. A multi-resolution analysis (MRA) framework is presented using a sparse low-rank approximation. We propose a primal-dual active set semi-smooth Newton method for the nonnegative factorization. Numerical results are given to demonstrate the effectiveness of the proposed method to capture features in images and structures of inverse problems under no a-priori assumption on the data structure, as well as to provide a sparse low-rank representation of the data. Mathematics Subject Classification (MSC2000): 15A23, 65F22, 65F30, 65F50, 78M25.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tensor Decompositions: A New Concept in Brain Data Analysis?

Matrix factorizations and their extensions to tensor factorizations and decompositions have become prominent techniques for linear and multilinear blind source separation (BSS), especially multiway Independent Component Analysis (ICA), Nonnegative Matrix and Tensor Factorization (NMF/NTF), Smooth Component Analysis (SmoCA) and Sparse Component Analysis (SCA). Moreover, tensor decompositions hav...

متن کامل

Survey on Probabilistic Models of Low-Rank Matrix Factorizations

Low-rank matrix factorizations such as Principal Component Analysis (PCA), Singular Value Decomposition (SVD) and Non-negative Matrix Factorization (NMF) are a large class of methods for pursuing the low-rank approximation of a given data matrix. The conventional factorization models are based on the assumption that the data matrices are contaminated stochastically by some type of noise. Thus t...

متن کامل

Riordan group approaches in matrix factorizations

In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.

متن کامل

Optimality, Computation, and Interpretation of Nonnegative Matrix Factorizations

The notion of low rank approximations arises from many important applications. When the low rank data are further required to comprise nonnegative values only, the approach by nonnegative matrix factorization is particularly appealing. This paper intends to bring about three points. First, the theoretical Kuhn-Tucker optimality condition is described in explicit form. Secondly, a number of nume...

متن کامل

Nonnegative Matrix Factorizations Performing Object Detection and Localization

We study the problem of detecting and localizing objects in still, gray-scale images making use of the part-based representation provided by non-negative matrix factorizations. Non-negative matrix factorization represents an emerging example of subspace methods which is able to extract interpretable parts from a set of template image objects and then to additively use them for describing indivi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014